Divide-and-Conquer Subspace Segmentation

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

Divide and Conquer: A Novel Approach to Segmentation and Model Building Using a Pattern-Oriented Clustering Approach

Divide and Conquer Low-rank Preconditioning Techniques

This paper presents a preconditioning method based on a recursive multilevel lowrank approximation approach. The basic idea is to recursively divide the problem into two and apply a low-rank approximation to a matrix obtained from the Sherman-Morrison formula. The low-rank approximation may be computed by the partial Singular Value Decomposition (SVD) or it can be approximated by the Lanczos bi...

Four Skeletons and a Function

Four algorithmic skeletons for low-level image processing and intermediate-level computer vision are presented, related to a common divide and conquer higher order function. The parallel operation of each skeleton is described and their use in a complete parallel multisource image segmentation system is discussed.

Speaker diarization using divide-and-conquer

Speaker diarization systems usually consist of two core components: speaker segmentation and speaker clustering. The current state-of-the-art speaker diarization systems usually apply hierarchical agglomerative clustering (HAC) for speaker clustering after segmentation. However, HAC’s quadratic computational complexity with respect to the number of data samples inevitably limits its application...